Introduction of Double Divide and Conquer and the Recent Progress
نویسندگان
چکیده
Abstract. An algorithm dubbed double Divide and Conquer is recently proposed, which first computes only singluar values by a part of Divide and Conquer and then computes the corresponding singular vectors by the twisted factorization. It accurately computes bidiagonal SVD in O(n) flops and is suited for parallelization when singular values are isolated. However, the twisted factorization can fail if singular values are tightly clustered. In this paper, we discuss the adaptation of a reorthogonalization process for double Divide and Conquer to cope with such matrices.
منابع مشابه
Free Vibration Analysis of Repetitive Structures using Decomposition, and Divide-Conquer Methods
This paper consists of three sections. In the first section an efficient method is used for decomposition of the canonical matrices associated with repetitive structures. to this end, cylindrical coordinate system, as well as a special numbering scheme were employed. In the second section, divide and conquer method have been used for eigensolution of these structures, where the matrices are in ...
متن کاملPreliminary Result of Parallel Double Divide and Conquer
This paper shows a concept for parallelization of double Divide and Conquer and its preliminary result. For singular value decomposition, double Divide and Conquer was recently proposed. It first computes singular values by a compact version of Divide and Conquer. The corresponding singular vectors are then computed by twisted factorization. The speed and accuracy of double Divide and Conquer a...
متن کاملطراحی ساختاری به روشDivide & Conquer و کاربرد آن در طراحی سوئیچ MSC
This paper presents the structural design for huge systems using Divide & Conquer (D&C) method as a scientific method for optimum designing of complex systems. This method divides the main system into several simple subsystems. Submitted equations in three different cases prove that the optimum response (number of subsystems for minimum system complexity) is independent of main system complexit...
متن کاملQUICKSELECT Revisited
We give an overview of the running time analysis of the random divide-and-conquer algorithm FIND or QUICKSELECT. The results concern moments, distribution of FIND’s running time, the limiting distribution, a stochastic bound and the key: a stochastic fixed point equation.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009